Highway Hierarchies Hasten Exact Shortest Path Queries
نویسندگان
چکیده
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes needed for maps of the USA or Western Europe in a few hours using linear space. Shortest (i.e. fastest) path queries then take around eight milliseconds to produce exact shortest paths. This is about 2 000 times faster than using Dijkstra’s algorithm.
منابع مشابه
Highway Hierarchies Star
We study two speedup techniques for route planning in road networks: highway hierarchies (HH) and goal directed search using landmarks (ALT). It turns out that there are several interesting synergies. Highway hierarchies yield a way to implement landmark selection more efficiently and to store landmark information more space efficiently than before. ALT gives queries in highway hierarchies an e...
متن کاملI/O Efficieny of Highway Hierarchies
Recently, Sanders and Schultes presented a shortest path algorithm, named Highway Hierarchies, for fast point-to-point shortest path queries. They report extremely quick average queries on the road network of USA. We consider the I/O efficiency of the algorithm and investigate how a good graph layout affects the average query time. We experiment with a few layout heuristics and obtain a speed-u...
متن کاملComputing Many-to-Many Shortest Paths Using Highway Hierarchies
We present a fast algorithm for computing all shortest paths between source nodes s ∈ S and target nodes t ∈ T . This problem is important as an initial step for many operations research problems (e.g., the vehicle routing problem), which require the distances between S and T as input. Our approach is based on highway hierarchies, which are also used for the currently fastest speedup techniques...
متن کاملRobust, Almost Constant Time Shortest-Path Queries in Road Networks
When you drive to somewhere ‘far away’, you will leave your current location via one of only a few ‘important’ traffic junctions. Recently, other research groups and we have largely independently developed this informal observation into transit node routing, a technique for reducing quickest-path queries in road networks to a small number of table lookups. The contribution of our paper is twofo...
متن کاملFast and Exact Shortest Path Queries Using Highway Hierarchies
The computation of shortest paths in a graph is a well-known problem in graph theory. One of the most obvious practical applications is route planning in a road network, i.e., finding an optimal route from a start location to a target location. We assume that a given road network does not change very often and that there are many source-target queries on the same network. Therefore, it pays to ...
متن کامل